package algorithm.leetcode.I601to800;


// 10  15  20    25     30     target
//  0   0  15+0  10+20  25+15  30+30
//         10+0   15+0  20+10  15+25
//           10     15     30     40

public class Q746 {

    public int minCostClimbingStairs(int[] cost) {
        int[] dp = new int[cost.length+1];
        dp[0] = 0;
        dp[1] = 0;

        for (int i = 2; i <= cost.length; i++) {
            dp[i] = Math.min(dp[i-1]+cost[i-1], dp[i-2]+cost[i-2]);
        }
        return dp[cost.length];
    }

}
